Experiments on the Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements

The decomposition of binary structuring elements is a key problem in morphological image processing. So far only the decomposition of convex structuring elements and of speciic subsets of non-convex ones have been proposed in the literature. This work presents the results of a new approach, based on a Genetic Algorithm, in which no constraints are imposed on the shape of the initial structuring element, nor assumptions are made on the elementary factors, which are chosen from a given set.